Betweenness centrality for temporal multiplexes
نویسندگان
چکیده
Abstract Betweenness centrality quantifies the importance of a vertex for information flow in network. The standard betweenness applies to static single-layer networks, but many real world networks are both dynamic and made several layers. We propose definition temporal multiplexes. This accounts topological structure duration paths determination shortest paths. an algorithm compute new metric using mapping graph. apply dataset $$\sim 20$$ ∼ 20 k European flights compare results with those obtained or metrics. differences airports rankings highlight considering multiplex appropriate distance metric.
منابع مشابه
Fully Dynamic Betweenness Centrality
We present fully dynamic algorithms for maintaining betweenness centrality (BC) of vertices in a directed graph G = (V,E) with positive edge weights. BC is a widely used parameter in the analysis of large complex networks. We achieve an amortized O(ν∗ · log n) time per update with our basic algorithm, and O(ν∗ · log n) time with a more complex algorithm, where n = |V |, and ν∗ bounds the number...
متن کاملFurther Results on Betweenness Centrality of Graphs
Betweenness centrality is a distance-based invariant of graphs. In this paper, we use lexicographic product to compute betweenness centrality of some important classes of graphs. Finally, we pose some open problems related to this topic.
متن کاملApproximating Betweenness Centrality
Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently the fastest-known algorithm by Brandes requires O(nm) time for unweighted graphs and O(nm + n log n) time for weighted graphs, where n is the number of vertices and m is the number of edges in the network. These are als...
متن کاملBetter Approximation of Betweenness Centrality
Estimating the importance or centrality of the nodes in large networks has recently attracted increased interest. Betweenness is one of the most important centrality indices, which basically counts the number of shortest paths going through a node. Betweenness has been used in diverse applications, e.g., social network analysis or route planning. Since exact computation is prohibitive for large...
متن کاملBetweenness centrality profiles in trees
Betweenness centrality of a vertex in a graph measures the fraction of shortest paths going through the vertex. This is a basic notion for determining the importance of a vertex in a network. The kbetweenness centrality of a vertex is defined similarly, but only considers shortest paths of length at most k. The sequence of k-betweenness centralities for all possible values of k forms the betwee...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific Reports
سال: 2021
ISSN: ['2045-2322']
DOI: https://doi.org/10.1038/s41598-021-84418-z